Characterizing subgroup perfect codes by 2-subgroups
نویسندگان
چکیده
A perfect code in a graph $$\Gamma $$ is subset C of $$V(\Gamma )$$ such that no two vertices are adjacent and every vertex ){\setminus } C$$ to exactly one C. Let G be finite group G. Then said if there exists Cayley admiting as code. It proved subgroup H only Sylow 2-subgroup This result provides way simplify the study codes general groups 2-groups. As an application, criterion for determining projective special linear $$\textrm{PSL}(2,q)$$ given.
منابع مشابه
Constructions for perfect 2-burst-correcting codes
In this correspondence, we present two constructions. In the first construction, we show how to generate perfect linear codes of length 2 , 5, and redundancy , which correct a single burst of length 2. In the second construction, we show how to generate perfect linear codes organized in bytes of length 2 , 5, with redundancy divisible by , which correct a single burst of length 2 within the bytes.
متن کاملCyclic Orbit Codes with the Normalizer of a Singer Subgroup
An algebraic construction for constant dimension subspace codes is called orbit code. It arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. In particular orbit codes of a Singer subgroup of the general linear group has investigated recently. In this paper, we consider the normalizer of a Singer subgroup of the general linear group a...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملPerfect Subgroups of Hnn Extensions
This note includes supporting material for Guilbault’s one-hour talk summarized elsewhere in these proceedings. We supply the group theory necessary to argue that Guilbault’s tame ends cannot be pseudocollared. In particular, we show that certain groups (the interated Baumslag-Solitar groups) cannot have any non-trivial perfect subgroups. The absence of non-trivial perfect subgroups, in turn, e...
متن کاملNo More Perfect Codes: Classification of Perfect Quantum Codes
We solve the problem of the classification of perfect quantum codes. We prove that the only nontrivial perfect quantum codes are those with the parameters ( ( 2 2 2 ( 1) ( 1) , ,3 l n q q q q − − − )) l . There exist no other nontrivial perfect quantum codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2023
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-023-01240-6